Separation of Multilinear Circuit and Formula Size

نویسنده

  • Ran Raz
چکیده

An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit polynomial f (x1, . . . ,xn) with coefficients in {0,1} such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log2 n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a superpolynomial gap between multilinear circuit and formula size, and separates multilinear NC1 circuits from multilinear NC2 circuits. ACM Classification: F.2.2, F.1.3, F.1.2, G.2.0 AMS Classification: 68Q15, 68Q17, 68Q25, 94C05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilinear-NC1 6= Multilinear-NC2

An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit example for a polynomial f(x1, ..., xn), with coefficients in {0, 1}, such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a super-polynomial gap ...

متن کامل

Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications

The complexity of Iterated Matrix Multiplication is a central theme in Computational Complexity theory, as the problem is closely related to the problem of separating various complexity classes within P. In this paper, we study the algebraic formula complexity of multiplying d many 2×2 matrices, denoted IMMd, and show that the well-known divide-andconquer algorithm cannot be significantly impro...

متن کامل

Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits

We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In particular we show the following: 1. There exists an explicit n-variate polynomial computable by linear sized multilinear depth three circuits (with only two product gates) such that every ROABP comp...

متن کامل

Tel Aviv University the Raymond and Beverly Sackler Faculty of Exact Sciences School of Computer Science Studies in Algebraic and Propositional Proof Complexity

The field of proof complexity aims at characterizing which statements have short proofs in a given formal proof system. This thesis is a contribution to proof complexity broadly construed as the field that studies the sizes of structured or symbolic proofs. Our focus will be on the development and complexity-theoretic study of new frameworks, mainly of an algebraic nature, for providing, among ...

متن کامل

Read-once polynomials: How many summands suffice?

An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over +,× where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theory of Computing

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2006